Adaptive Job Scheduling with Load Balancing for Workflow Application in Grid Platform

Grid computing servers as the globally connected systems which performs high computing in many practical applications. Scheduling plays a key role in providing performance for grid workflow applications. Various scheduling strategies are proposed, including static scheduling strategies which map jobs to resources before execution time, or dynamic alternatives which schedule individual job only when it is ready to execute. Both of the schedules require significantly high scheduling cost and they may not produce good quality of schedule with low cost. This paper proposes a novel semi dynamic algorithm with load balancing concept, which allows the schedule to adapt and schedule the jobs as per the changes in the dynamic grid environment. The proposed novel algorithm schedules the job statically and continues the schedule with dynamic scheduling due to the dynamic nature of the grid. The makespan and the resource usage are the main to objective of this scheduling algorithm. When the resource and International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print) ISSN 0976 – 6375(Online) Volume 2 Number 1, Dec Jan (2011), pp. 09-21 © IAEME, http://www.iaeme.com/ijcet.html IJCET © I A E M E International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 2, Number 1, Dec Jan (2011), © IAEME 10 performance fluctuation occur in the grid environment it affects the processing of the jobs which results in the delay in the job completion time. In this algorithm load balancing is incorporated to handle such situation where the jobs are handled after it is dispatched to their respective hosts. When there is resource fluctuation occurs due to the dynamic nature of the grid or over loading of jobs to a processor which delays the makespan, load balancing is done to handle the job execute and to get desired makespan.